Cylindric Algebras of First - Order Languages
نویسنده
چکیده
We show when two countable first-order languages have isomorphic cylindric algebras. Introduction. The cylindric algebra of a language is the co-dimensional cylindric algebra of formulas of the language modulo logical equivalence. We classify first-order languages according to the isomorphism types of their cylindric algebras. For two languages involving only predicate symbols, their cylindric algebras are isomorphic iff for every nEu, both languages have the same number of predicate symbols with at least n places. This solves the classification problem for free co-dimensional locally-finite cylindric algebras [4, Problem 2.8, p. 463] since these algebras are exactly the cylindric algebras of languages involving only predicate symbols. For any first-order theory, the topological space of its models with ECA classes (classes which consist of all models of some theory) as closed sets is a natural dual for the Lindenbaum-Tarski algebra of the theory. By enriching the class of models to the concrete category of models and isomorphisms and replacing the topology with the ultraproduct operations, we obtain a natural model-theoretic dual for the cylindric algebra of formulas of the theory. This duality is used in demonstrating that various properties of languages are invariant under cylindric isomorphism. The basic tool used in isomorphism construction is a decomposition version of the Cantor back-and-forth construction [7]. Notation. All languages, theories and sets of symbols will be countable. All theories will be first-order theories with equality. "Symbol" will mean nonlogical symbol. The type of an «-ary predicate symbol is n; that of an w-ary operation symbol is n + fa. Propositional letters are regarded as 0-ary predicate symbols and constants as 0-ary operation symbols. Let lAu = {XA, IVi, 2lA, . . .}. The {full) type sequence of a language is the sequence where a¡ is the number (possibly co) of symbols of the language of type i. The reduced type sequence is the sequence (b0, bx/i, bx, bx I/2, . . . > where b¡ is co if there are Received by the editors September 23, 1974. AMS (MOS) subject classifications (1970). Primary 02J15.
منابع مشابه
Independence-friendly cylindric set algebras
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of ...
متن کاملA non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct
We construct an infinite dimensional quasi-polyadic equality algebra A such that its cylindric reduct is representable, while A itself is not representable. 1 The most well known generic examples of algebraizations of first order logic are Tarski’s cylindric algebras (CA) and Halmos’ polyadic equality algebras (PEA). The theory of cylindric algebras is well developed in the treatise [10], [11],...
متن کاملBare canonicity of representable cylindric and polyadic algebras
We show that for finite n ≥ 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived fr...
متن کاملRelation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory
We confirm a conjecture, about neat embeddings of cylindric algebras, made in 1969 by J. D. Monk, and a later conjecture by Maddux about relation algebras obtained from cylindric algebras. These results in algebraic logic have the following consequence for predicate logic: for every finite cardinal α ≥ 3 there is a logically valid sentence X, in a first-order language L with equality and exactl...
متن کاملOn Neat Embeddings of Algebraisations of First Order Logic
Let α be an infinite ordinal. There are non-isomorphic representable algebras of dimension α each of which is a generating subreduct of the same β dimensional algebra. Dually there exists a representable algebra A of dimension , α such that A is a generating subreduct of B and , B′ however, B and B′ are not isomorphic. The above was proven to hold for infinite dimensional cylindric algebras (CA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010